PROVE-IT to IMPROVE-IT

The Discriminating Mind: Define It, Prove It

It’s Not Magic: I Can Prove It

Our work presents a new approach to developing, analyzing, and proving correctness of programs intended for execution on a quantum computer. We provide tools to write quantum as well as classical specifications, develop quantum and classical solutions for them, and analyses various properties of quantum specifications and quantum programs, such as implementability, time and space complexity, an...

It's Doomed; We Can Prove It

Programming errors found early are the cheapest. Tools applying to the early stage of code development exist but either they suffer from false positives (“noise”) or they require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, in whatever state it is started. We use a formal verif...

Your System is Secure? Prove it!

Computer security is an old problem which has lost none of its relevance — as is evidenced by the annual Security issue of ;login:. The systems research community has increased its attention to security issues in recent years, as can be seen by an increasing number of security-related papers published in the mainstream systems conferences SOSP, OSDI, and USENIX. However, the focus is primarily ...

How to prove it in Natural Deduction: A Tactical Approach

The motivation for this paper comes out of our experience with teaching natural deduction (ND) and with the way this formal system is implemented by the Coq proof assistant, namely by means of so-called tactics, which are heuristics that transform a goal formula into a sequence of subgoals whose provability implies that of the original formula. We aim at capturing some of these tactics into a s...